Mining Violations to Relax Relational Database Constraints

نویسندگان

  • Mirjana Mazuran
  • Elisa Quintarelli
  • Rosalba Rossato
  • Letizia Tanca
چکیده

Frequent constraint violations on the data stored in a database may suggest that the semantics of the represented reality is changing. In this work we propose a methodology and a tool, based on data mining, to maintain the integrity constraints specified at design time, in order to adjust them to the evolutions of the modeled reality that may occur during the database life. The approach we propose allows to isolate frequent and meaningful constraint violations and, consequently, to extract novel rules that can be used to update/relax the no longer up-to-date integrity constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Database Intrusion Detection using Weighted Sequence Mining

Data mining is widely used to identify interesting, potentially useful and understandable patterns from a large data repository. With many organizations focusing on webbased on-line transactions, the threat of security violations has also increased. Since a database stores valuable information of an application, its security has started getting attention. An intrusion detection system (IDS) is ...

متن کامل

An Ilp - Based Concept Discovery System for Multi - Relational Data Mining

AN ILP-BASED CONCEPT DISCOVERY SYSTEM FOR MULTI-RELATIONAL DATA MINING Kavurucu, Yusuf Ph.D., Department of Computer Engineering Supervisor : Asst. Prof. Dr. Pınar Şenkul July 2009, 118 pages Multi Relational Data Mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. However, as patter...

متن کامل

OO-FSG: An Object-Oriented Approach to Mine Frequent Subgraphs

Frequent subgraph mining (FSG) has always been an important issue in data mining. Several frequent subgraph mining methods have been developed for mining graph data. However, most of these are main memory algorithms in which scalability is a bigger issue. A few algorithms have opted for a relational approach that stores the graph data in relational tables. However, relational databases have the...

متن کامل

Incremental Mining of Constrained Associations

The advent of data warehouses has shifted the focus of data mining from file-based systems to database systems in recent years. Architectures and techniques for optimizing mining algorithms for relational as well as Object-relational databases are being explored with a view to tightly integrate mining into data warehouses. Interactive mining and incremental mining are other useful techniques to...

متن کامل

Metadata Enrichment for Automatic Data Entry Based on Relational Data Models

The idea of automatic generation of data entry forms based on data relational models is a common and known idea that has been discussed day by day more than before according to the popularity of agile methods in software development accompanying development of programming tools. One of the requirements of the automation methods, whether in commercial products or the relevant research projects, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009